The Multiset Partition Algebra
نویسندگان
چکیده
We introduce the multiset partition algebra $${\cal M}{{\cal P}_k}\left(\xi \right)$$ over polynomial ring F[ξ], where F is a field of characteristic 0 and k positive integer. When ξ specialized to integer n, we establish Schur—Weyl duality between actions resulting P}_k}\left(n symmetric group Sn on Symk(Fn). The construction generalizes any vector λ non-negative integers yielding P}_\lambda}\left(\xi F[ξ] so that there P}_\lambda}\left(n Symλ(Fn). find generating function for multiplicity each irreducible representation in Symλ(Fn), as varies, terms plethysm Schur functions. As consequences obtain an indexing set representations GLn(F) when restricted Sn. show embeds inside $${{\cal P}_{\left| \lambda \right|}}\left(\xi . Using this embedding, algebras are generically semisimple F. Also, specialization at v F, prove P}_\lambda}\left(v cellular algebra.
منابع مشابه
The rook partition algebra
The rook partition algebra RPk(x) is a semisimple algebra for all but a finite number of values of x ∈ C that arises from looking at what commutes with the action of the symmetric group Sn on U ⊗k, where U is the direct sum of the natural representation and the trivial representation of Sn. We give a combinatorial description of this algebra, construct its irreducible representations, and exhib...
متن کاملq-Partition algebra combinatorics
We study a q-analog Qr(n, q) of the partition algebra Pr(n). The algebra Qr(n, q) arises as the centralizer algebra of the finite general linear group GLn(Fq) acting on a vector space IR q coming from r-iterations of Harish-Chandra restriction and induction. For n ≥ 2r, we show that Qr(n, q) has the same semisimple matrix structure as Pr(n). We compute the dimension dn,r(q) = dim(IR r q ) to be...
متن کاملDisjoint, Partition and Intersection Constraints for Set and Multiset Variables
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints. These global constraints fall into one of three classes. In the first class, we show that we can decompose the constraint without hindering bound consistency. No new algorithms therefore need be developed for such constraints. In the second ...
متن کاملPartition Analysis, Modular Functions, and Computer Algebra
This article describes recent developments connecting problems of enumerative combinatorics, constrained by linear systems of Diophantine inequalities, with number theory topics like partitions, partition congruences, and q-series identities. Special emphasis is put on the role of computer algebra algorithms. The presentation is intended for a broader audience; to this end, elementary introduct...
متن کاملApplying Relation Partition Algebra for Reverse Architecting
The ever increasing complexity and ever more rapidly changing requirements for software systems create a need for reuse and adaptation of existing software. An explicit description of the software architecture of a system may help to get a high-level overview of the system, thus facilitating re-use and adaptation of the system. Reverse architecting is a technique applied within Philips to make ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2022
ISSN: ['1565-8511', '0021-2172']
DOI: https://doi.org/10.1007/s11856-022-2410-7